Rao's degree sequence conjecture
نویسندگان
چکیده
منابع مشابه
Rao's degree sequence conjecture
Let us say two (simple) graphs G,G′ are degree-equivalent if they have the same vertex set, and for every vertex, its degrees in G and in G′ are equal. In the early 1980’s, S. B. Rao made the conjecture that in any infinite set of graphs, there exist two of them, say G and H, such that H is isomorphic to an induced subgraph of some graph that is degree-equivalent to G. We prove this conjecture.
متن کاملOn a degree sequence analogue of Pósa's conjecture
A famous conjecture of Pósa from 1962 asserts that every graph on n vertices and with minimum degree at least 2n/3 contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Komlós, Sárközy and Szemerédi [17]. We prove a degree sequence version of Pósa’s conjecture: Given any η > 0, every graph G of sufficiently large order n contains the square of a Hamilton...
متن کاملDegree sequence index strategy
We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence. As an illustration of the DSI strategy, we show how it can be used to give new upper and lower bounds on the k-independence and the k-domination numbers. These include, among other things, a double generalization of the annihilation num...
متن کاملDegree sequence and supereulerian graphs
A sequence d = (d1, d2, · · · , dn) is graphic if there is a simple graph G with degree sequence d, and such a graph G is called a realization of d. A graphic sequence d is linehamiltonian if d has a realizationG such that L(G) is hamiltonian, and is supereulerian if d has a realization G with a spanning eulerian subgraph. In this paper, it is proved that a nonincreasing graphic sequence d = (d...
متن کاملAsymptotic Enumeration by Degree Sequence of Graphs of High Degree
We consider the estimation of the number of labelled simple graphs with degree sequence d1, d2, . . . , dn by using an n-dimensional Cauchy integral. For suffiently small and any c > 2 3 , an asymptotic formula is obtained when |di − d| < n for all i and d = d(n) satisfies min{d, n − d − 1} ≥ cn/ log n as n → ∞. These conditions include the degree sequences of almost all graphs, so our result g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2014
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2013.12.003